Generalized Cut Method for Computing Szeged–Like Polynomials with Applications to Polyphenyls and Carbon Nanocones

Szeged, Padmakar-Ivan (PI), and Mostar indices are some of the most investigated distance-based Szeged-like topological indices. On other hand, polynomials related to these were also introduced, for example Szeged polynomial, edgeSzeged PI etc. In this paper, we introduce a concept general polynomial connected strength-weighted graph. It turns out that includes all above mentioned infinitely many graph polynomials. As main result prove cut method which enables us efficiently calculate by using corresponding quotient graphs obtained partition edge set is coarser than Θ∗ -partition. To best our knowledge, represents first implementation famous Finally, show how deduced can be applied para-polyphenyl chains carbon nanocones.